package ljl.alg.wangzheng_camp.round1.dp;

public class _1143_longest_common_subseq {
    
    /**
     * 不会做 投降了
     * dp[i][j] 含义是：0..i 0..j 的最大公共子序列长度
     * */
    public int longestCommonSubsequence(String text1, String text2) {
        int m = text1.length(), n = text2.length();
        int[][] dp = new int[m + 1][n + 1];
        for (int i = 1; i <= m; i++) {
            for (int j = 1; j <= n; j++) {
                if (text1.charAt(i - 1) == text2.charAt(j - 1))
                    dp[i][j] = dp[i - 1][j - 1] + 1;
                else
                    dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
            }
        }
        return dp[m][n];
    }
    
}
